package com.test;

import java.util.Arrays;

public class Node {
    int depth;                       //当前节点在搜索树的深度
    int arr[][] = new int[3][3];     //八数码
    int value;                       //当前节点在搜索树的深度+当前节点中“不在位的”数码个数
    int i;                          //i,j表示当前节点中空格的下标
    int j;

    public Node() {
    }

    public Node(int depth, int[][] arr, int value, int i, int j) {
        this.depth = depth;
        this.value = value;
        this.i = i;
        this.j = j;
        this.arr = arr;
    }

    @Override
    public String toString() {
        return "Node{" +
                "depth=" + depth +
                ", arr=" + Arrays.toString(arr) +
                ", value=" + value +
                ", i=" + i +
                ", j=" + j +
                '}';
    }
}
